Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
a__c → a__f(g(c))
a__f(g(X)) → g(X)
mark(c) → a__c
mark(f(X)) → a__f(X)
mark(g(X)) → g(X)
a__c → c
a__f(X) → f(X)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
a__c → a__f(g(c))
a__f(g(X)) → g(X)
mark(c) → a__c
mark(f(X)) → a__f(X)
mark(g(X)) → g(X)
a__c → c
a__f(X) → f(X)
Q is empty.
We use [27] with the following order to prove termination.
Knuth-Bendix order [24] with precedence:trivial
and weight map:
mark_1=5
c=1
a__c=5
f_1=1
a__f_1=2
g_1=1